Cyclic and pseudo-cyclic MDS codes of length q + 1

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cyclic arcs and pseudo-cyclic MDS codes

Cyclic arcs (defined by Storme and Van Maldghem, [1994]) and pseudocyclic MDS codes are equivalent objects. We survey known results on the existence of cyclic arcs. Some new results on cyclic arcs in PG(2, q) are also given.

متن کامل

Cyclic codes of arbitrary length over F q + uF q + u 2 F q + . . . + u k − 1 F

In this paper, we study the structure of cyclic codes of an arbitrary length n over the ring Fq + uFq + uFq + . . . + uFq, where u = 0 and q is a power of prime. Also we study the rank for these codes, and we find their minimal spanning sets. This study is a generalization and extension of the works in references [9] and [12], the dual codes over the ring Fq + uFq + uFq, where u3 = 0 are studie...

متن کامل

Gradient Coding from Cyclic MDS Codes and Expander Graphs

Gradient Descent, and its variants, are a popular method for solving empirical risk minimization problems in machine learning. However, if the size of the training set is large, a computational bottleneck is the computation of the gradient, and hence, it is common to distribute the training set among worker nodes. Doing this in a synchronous fashion faces yet another challenge of stragglers (i....

متن کامل

Skew cyclic codes of arbitrary length

In this paper we study a special type of linear codes, called skew cyclic codes, in the most general case. This set of codes is a generalization of cyclic codes but constructed using a non-commutative ring called the skew polynomial ring. In previous works these codes have been studied with certain restrictions on their length. This work examines their structure for an arbitrary length without ...

متن کامل

Cyclic Codes Over Z4 of Even Length

We determine the structure of cyclic codes over Z4 for arbitrary even length giving the generator polynomial for these codes. We determine the number of cyclic codes for a given length. We describe the duals of the cyclic codes, describe the form of cyclic codes that are self-dual and give the number of these codes. We end by examining specific cases of cyclic codes, giving all cyclic self-dual...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1992

ISSN: 0097-3165

DOI: 10.1016/0097-3165(92)90104-3